Partial Type Inference with Higher-Order Types
نویسنده
چکیده
The language MLF is an extension of System F that permits robust first-order partial type inference with second-order polymorphism. We propose an extension of MLF’s graphical presentation with higherorder types and reduction at the type level as in System Fω. As inference of higher-order types won’t be possible in general, the extension introduces System F-style explicit type abstraction and type application.
منابع مشابه
An Introduction to Program Specialisation by Type Inference
In this paper we present a new paradigm for partial evaluation, based not on transforming terms into terms, but on transforming terms and types into terms and types. An immediate advantage is that residual programs need not involve the same types as source programs, so type specialisation can be accomplished naturally. Furthermore, while a conventional partial evaluator handles a static express...
متن کاملCompiling Curried Functional Languages to .NET
Recent trends in programming language implementation are moving more and more towards “managed” runtime environments. These offer many benefits, including static and dynamic type checking, security, profiling, bounds checking and garbage collection. The Common Language Infrastructure (CLI) is Microsoft’s attempt to define a managed runtime environment. However, since it was designed with more m...
متن کاملAn Abstract, Approximation-Based Approach to Embedded Code Pointers and Partial-Correctness
To support higher-order type-like features such as embedded code pointers, in logic-based verification, one approach is to build assertion logic that combines logic and types. But it is not totally satisfactory in various aspects. Another approach is to use approximation in logic to simulate the behavior of types and typing invariants, yet polluting program specifications and proofs with comple...
متن کاملEecient Inference of Partial Types
Partial types for the -calculus were introduced by Thatte in 1988 [8] as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persistent data. In that paper he showed that type inference for partial types was semidecidable. Decidability remained open until quite recently, when O'Keefe and Wand [5] gave an exponential time algorithm for type inference...
متن کاملGraphical and Incremental Type Inference: A Graph Transformation Approach
We present a graph grammar based type inference system for a totally graphic development language. NiMo (Nets in Motion) can be seen as a graphic equivalent to Haskell that acts as an on-line tracer and debugger. Programs are process networks that evolve giving total visibility of the execution state, and can be interactively completed, changed or stored at any step. In such a context, type inf...
متن کامل